Calendar Queue Expectations
نویسنده
چکیده
منابع مشابه
FELT: A Far Future Event List Structure Optimized for Calendar Queues
Calendar queues (CQ) are often employed in discrete event simulators to store pending events. They can achieve O(1) access time as long as the CQ resizes often enough to ensure that events are not skewed but evenly distributed in the queue structure. However, a resize operation would involve creating a new CQ structure and then moving each item from the old CQ to the new CQ before discarding th...
متن کاملSmart priority queue algorithms for self-optimizing event storage
Low run-time overhead, self-adapting storage policies for priority queues called Smart Priority Queue (SPQ) techniques are developed and evaluated. The proposed SPQ policies employ a lowcomplexity linear queue for near-head activities and a rapid-indexing variable bin-width calendar queue for distant events. The SPQ configuration is determined by monitoring queue access behavior using cost-scor...
متن کاملRelation : Lazy Queue Implementation and Analysis
1 Lazy Queue 1.1 Lazy Queue Description The lazy queue [1] is based on multi-list and extends the idea of calendar queue. The set is divided into tree part and only a little part is kept sorted: ❶ a near future (NF) that is kept sorted, ❷ a far future (FF), that is partially sorted1, ❸ a very far future (VFF), that is used as an overflow bucket As time advances, part of the far future (the firs...
متن کاملAn Efficient Scheduling Mechanism for Simulating Concurrent Events in Wireless Communications Based on an Improved Priority Queue (PQ) TDM Layered Multi-Threading Approach
The physical activities of a real wireless network are represented by events which are the main components of a discrete event simulation (DES) system and are produced by its event generator during simulation time. Each network service (e.g. voice, data and video) constitutes an event for a particular mobile user. A critical component within the simulation system, called scheduler, runs by sele...
متن کاملLazy Queue: A new approach to implementing the Pending-event Set
In discrete event simulation, very often the future event set is represented by a priority queue. The data structure used to implement the queue and the way operations are performed on it are often crucial to the execution time of a simulation. In this paper a new priority queue implementation strategy, the Lazy Queue, is presented. It is tailored to handle operations on the pending event set e...
متن کامل